on rainbow 4-term arithmetic progressions

{sl let $[n]={1,dots, n}$ be colored in $k$ colors. a rainbow ap$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. conlon, jungi'{c} and radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow ap(4) free, when $n$ is even. based on their construction, we show that such a coloring of $[4n]$ also exists for odd $n>1$. we conclude that for nonnegative integers $kgeq 3$ and $n > 1$, every equinumerous $k$-coloring of $[kn]$ contains a rainbow ap$(k)$ if and only if $k=3$.}